Domain Construction for Mode Analysis of Typed Logic Programs

Logic program development based on typed moded schemata and data types

The main contribution of the thesis is to develop a comprehensive framework for developinglogic programs using ve program schemata and some basic data types, and to evaluate itssuitability for developing sizable programs. The schemata are intended to capture designdecisions made by a programmer during top-down re nement of a predicate. The schemataare completely independent from...

A Prioritization Model for HSE Risk Assessment Using Combined Failure Mode, Effect Analysis, and Fuzzy Inference System: A Case Study in Iranian Construction Industry

The unavailability of sufficient data and uncertainty in modeling, some techniques, and decision-making processes play a significant role in many engineering and management problems.  Attain to sure solutions for a problem under accurate consideration is essential.  In this paper, an application of fuzzy inference system for modeling the indeterminacy involved in the problem of HSE risk assessm...

Mode Checking Using Constrained Regular Trees

In a previous paper we presented a high level polymorphic mode system for logic programs. In this paper we present an algorithm which checks if a program is well moded, given that is it well-typed in the sense of Mycroft and O'Keefe. A program is well-moded if the set of ground atoms deened by mode declarations is a superset of the success set. The novelty of the algorithm is the expressiveness...

Mode Analysis Domains for Typed Logic Programs

Termination Analysis with Types Is More Accurate

In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination of (type correct) programs. Type information for programs may be either inferred automatically or declared by the programmer. The analysis of the typed logic programs is able to completely reuse a framework for termination ana...